Cyclotomic factors of Coxeter polynomials

In this paper we show that the cyclotomic factors of the En Coxeter polynomials depend only on the value of nmod360, and come exclusively from spherical subdiagrams.     

On zeros of discrete orthogonal polynomials

We exploit difference equations to establish sharp inequalities on the extreme zeros of the classical discrete orthogonal polynomials, Charlier, Krawtchouk, Meixner and Hahn. We also provide lower bounds on the minimal distance between their consecutive zeros.     

On the existence of the best discrete approximation in norm by reciprocals of real polynomials

For the given data (w_i,x_i,y_i), i=1,…,M, we consider the problem of existence of the best discrete approximation in l_p norm (1≤p<∞) by reciprocals of real polynomials. For this problem, the existence of best approximations is not always guaranteed. In this paper, we give a condition on data which is necessary and sufficient for the existence of the best approximation in l_p norm. This condition is theoretical in nature. We apply it to obtain several other existence theorems very useful in practice. Some illustrative examples are also included.     

Universality limits for random matrices and de Branges spaces of entire functions

We prove that de Branges spaces of entire functions describe universality limits in the bulk for random matrices, in the unitary case. In particular, under mild conditions on a measure with compact support, we show that each possible universality limit is the reproducing kernel of a de Branges space of entire functions that equals a classical Paley-Wiener space. We also show that any such reproducing kernel, suitably dilated, may arise as a universality limit for sequences of measures on [−1,1].     

Approximation properties for generalized q-Bernstein polynomials

In this paper, we introduce the generalized q-Bernstein polynomials based on the q-integers and we study approximation properties of these operators. In special case, we obtain Stancu operators or Phillips polynomials.     

Legendre polynomial solutions of high-order linear Fredholm integro-differential equations

In this study, a Legendre collocation matrix method is presented to solve high-order Linear Fredholm integro-differential equations under the mixed conditions in terms of Legendre polynomials. The proposed method converts the equation and conditions to matrix equations, by means of collocation points on the interval [−1, 1], which corresponding to systems of linear algebraic equations with Legendre coefficients. Thus, by solving the matrix equation, Legendre coefficients and polynomial approach are obtained. Also examples that illustrate the pertinent features of the method are presented and by using the error analysis, the results are discussed.     

Application of Rouche’s theorem for MP filter design

The method for the minimum-phase (MP) finite impulse response (FIR) filter design, based on Rouche’s theorem from complex analysis is presented here. The filter is designed directly from a given specification. The method uses the cosine filters and the sharpening technique resulting in a multiplierless filter.     

On a Steffensen-Hermite method of order three

In this paper we study a third order Steffensen type method obtained by controlling the interpolation nodes in the Hermite inverse interpolation polynomial of degree 2. We study the convergence of the iterative method and we provide new convergence conditions which lead to bilateral approximations for the solution; it is known that the bilateral approximations have the advantage of offering a posteriori bounds of the errors. The numerical examples confirm the advantage of considering these error bounds.     

Non-symmetric Cauchy kernels for the classical groups

We give non-symmetric versions of the Cauchy kernel and Littlewood's kernels, corresponding to the types A, B, C and D, of the classical groups. Defining two families of key polynomials (one of them being the Demazure characters), we show that these new kernels are diagonal in the basis of key polynomials. We define scalar products such that the two families of key polynomials are adjoint to each other.     

The Multivariate Integer Chebyshev Problem

The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in ℂ ^d . We study this problem on general sets but devote special attention to product sets such as cube and polydisk. We also establish a multivariate analog of the Hilbert–Fekete upper bound for the integer Chebyshev constant, which depends on the dimension of space. In the case of single-variable polynomials in the complex plane, our estimate coincides with the Hilbert–Fekete result.